Mobile Agent Algorithms Versus Message Passing Algorithms
نویسندگان
چکیده
The mobile agent paradigm has been developed to solve problems in dynamic and heterogeneous environment [8]. The agent model of this paper is quite general. It is based on the concepts of agents, communication links and places. An agent is an entity which executes an algorithm: it can move from place to place (with some data and its algorithm) through communication links and it can make local computations on a place (a place provides tools for local computations: data, memories and process). Thus a mobile agent system is defined:
منابع مشابه
Checkpointing and Rollback of Wide-area Distributed Applications using Mobile Agents
We consider the problem of designing rollback error recovery algorithms for dynamic, wide area distributed systems like the Internet. The characteristics and the scale of such a system complicate the design and performance of the algorithms. Traditional message passing based algorithms incur large overhead, in both the network traffic and message passing delay, in such a wide-area environment. ...
متن کاملCheckpointing and Recovery Algorithms Using Mobile Agents on a Hamiltonian Topology
Traditional message passing based checkpointing and rollback recovery algorithms perform well for closely coupled systems. In wide area distributed systems these algorithms may incur large overhead due to message passing delay and network traffic. So to design checkpointing and rollback recovery algorithms for wide area distributed systems, mobile agents are introduced. Network topology is assu...
متن کاملFault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents
The recently established computational equivalence between the traditional message-passing model and the mobile-agents model is based on the existence of a mobile-agents algorithm that simulates the execution of message-passing algorithms. Like most existing protocols for mobile agents, this simulation protocol works correctly only if the agents are fault-free. We consider the problem of perfor...
متن کاملLocal Maps: New Insights into Mobile Agent Algorithms
In this paper, we study the complexity of computing with mobile agents having small local knowledge. In particular, we show that the number of mobile agents and the amount of local information given initially to agents can significantly influence the time complexity of resolving a distributed problem. Our results are based on a generic scheme allowing to transform a message passing algorithm, r...
متن کاملMobile agents in distributed computing: Network exploration
One of the recent paradigms in networked distributed computing is the use of mobile agents. Mobile agents are software robots that can autonomously migrate from node to node within a network. Although mobile agents can be easily implemented over a message passing network, they provide an abstraction for designing algorithms in a non-traditional way which can be quite natural for certain problem...
متن کامل